h-perfect plane triangulations
نویسندگان
چکیده
We characterise t-perfect plane triangulations by forbidden induced subgraphs. As a consequence, we obtain that a plane triangulation is h-perfect if and only if it is perfect.
منابع مشابه
Graphs of Triangulations and Perfect Matchings
Given a set P of points in the plane, the graph of triangulations T (P ) of P has a vertex for every triangulation of P , and two of them are adjacent if they differ by a single edge exchange. We prove that the subgraph TM(P ) of T (P ), consisting of all triangulations of P that admit a perfect matching, is connected. A main tool in our proof is a result of independent interest, namely that th...
متن کاملEdge proximity and matching extension in planar triangulations
Let G be a graph with at least 2(m+ n+1) vertices. Then G is E(m,n) if for each pair of disjoint matchings M,N ⊆ E(G) of size m and n respectively, there exists a perfect matching F in G such that M ⊆ F and F ∩N = ∅. In the present paper we wish to study property E(m,n) for the various values of integers m and n when the graphs in question are restricted to be planar. It is known that no planar...
متن کاملMatching extension in quadrangulations of the torus
A graph G is said to have the property E(m,n) if, given any two disjoint matchings M and N where |M | = m and |N | = n respectively and M ∩ N = ∅, there is a perfect matching F in G such that M ⊆ F and F ∩N = ∅. This property has been previously studied for triangulations of the plane, projective plane, torus and Klein bottle. Here this study is extended to quadrangulations of the torus.
متن کاملGenerating All Triangulations of Plane Graphs
In this paper, we deal with the problem of generating all triangulations of plane graphs. We give an algorithm for generating all triangulations of a triconnected plane graph G of n vertices. Our algorithm establishes a tree structure among the triangulations of G, called the “tree of triangulations,” and generates each triangulation of G in O(1) time. The algorithm uses O(n) space and generate...
متن کاملOn 3-coloring of plane triangulations
Let G be a plane triangulation. For a color-assignment λ : V (G) → {1, 2, 3}, a face of G whose vertices receive all three colors is called a vivid face with respect to λ. Let hλ(G) be the number of vivid faces in G with respect to λ. Let C(G) be the set of 3-color-assignments of G and let G(n) be the set of plane triangulations with n faces. Let h(G) = max{hλ(G) : λ ∈ C(G)} and h(n) = min{h(G)...
متن کامل